Voting-based Intra Mode Bit Skip Using Pixel Information in Neighbor Blocks
نویسندگان
چکیده
منابع مشابه
Enhanced Intra Mode Bit Skip Algorithm for H.264/AVC
In this paper, we propose an intra mode bit skip algorithm for H.264 intra 4×4 mode to reduce the mode representation burden. The proposed algorithm enhances the “adaptive intra mode bit skip (AIMBS)” in literature by considering the bit skip for more modes rather than only DC mode. In this work, the correlation between vertical and horizontal differences of reference pixels and encoded modes a...
متن کاملFuzzy Neighbor Voting for Automatic Image Annotation
With quick development of digital images and the availability of imaging tools, massive amounts of images are created. Therefore, efficient management and suitable retrieval, especially by computers, is one of themost challenging fields in image processing. Automatic image annotation (AIA) or refers to attaching words, keywords or comments to an image or to a selected part of it. In this paper,...
متن کاملEmbedding a Block-based Intra Mode in Frame-based Pixel Domain Wyner-Ziv Video Coding
Distributed source coding principles have been recently applied to video coding in order to achieve a flexible distribution of the complexity burden between the encoder and the decoder. In this paper we elaborate on a pixel based WynerZiv video codec that shifts all the complexity of the motion estimation phase to the decoder, thus achieving light encoding. We observe that the correlation noise...
متن کاملFace Recognition Using Plurality Voting and Collaborative Representation based on the Bit-plane Information
As a new representation technique, collaboration representation is used to represent the test sample with all training samples from all classes. Plurality voting is one of the most widely used combination strategies in pattern recognition. This paper presents a new and an efficient face recognition approach using plurality voting and collaboration representation based on the binary bit-plane im...
متن کاملNearest Neighbor Search on Large-scale Data Using Skip Graph
Nearest neighbor search is one of the most fundamental queries on massive datasets, and it has extensive applications such as pattern recognition, statistical classification, graph algorithms, Location-Based Services and online recommendations. In this report, we propose a new searchable scheme, which can efficiently and securely enable nearest neighbor search over encrypted data on untrusted n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Broadcast Engineering
سال: 2010
ISSN: 1226-7953
DOI: 10.5909/jbe.2010.15.4.498